Decomposing and Clique-Coloring (Diamond, Odd-Hole)-Free Graphs
نویسندگان
چکیده
A diamond is a graph on 4 vertices with exactly one pair of non-adjacent vertices, and an odd hole is an induced cycle of odd length. If G,H are graphs, G is H-free if no induced subgraph of G is isomorphic to H. A clique-colouring of G is an assignment of colours to the vertices of G such that no inclusion-wise maximal clique of size at least 2 is monochromatic. We show that every (diamond, odd-hole)-free graph is 3-clique-colourable, answering a question of Bacsó [1].
منابع مشابه
Structure and algorithms for (cap, even hole)-free graphs
A graph is even-hole-free if it has no induced even cycles of length 4 or more. A cap is a cycle of length at least 5 with exactly one chord and that chord creates a triangle with the cycle. In this paper, we consider (cap, even hole)-free graphs, and more generally, (cap, 4-hole)-free odd-signable graphs. We give an explicit construction of these graphs. We prove that every such graph G has a ...
متن کاملEven-hole-free graphs that do not contain diamonds: A structure theorem and its consequences
In this paper we consider the class of simple graphs defined by excluding, as induced subgraphs, even holes (i.e., chordless cycles of even length) and diamonds (i.e., a graph obtained from a clique of size 4 by removing an edge). We say that such graphs are (evenhole, diamond)-free. For this class of graphs we first obtain a decomposition theorem, using clique cutsets, bisimplicial cutsets (wh...
متن کاملA Transformation Which Preserves the Clique Number
We introduce a graph transformation which preserves the clique number. When applied to graphs containing no odd hole and no cricket (a particular graph on 5 vertices) the transformation also preserves the chromatic number. Using this transformation we derive a polynomial algorithm for the computation of the clique number of all graphs in a class which strictly contains diamond-free graphs. Furt...
متن کاملA note on coloring (even-hole, cap)-free graphs
A hole is a chordless cycle of length at least four. A hole is even (resp. odd) if it contains an even (resp. odd) number of vertices. A cap is a graph induced by a hole with an additional vertex that is adjacent to exactly two adjacent vertices on the hole. In this note, we use a decomposition theorem by Conforti et al. (1999) to show that if a graph G does not contain any even hole or cap as ...
متن کاملOn (P5, diamond)-free graphs
We study the stability number, chromatic number and clique cover of graphs with no induced P5 and diamonds. In particular, we provide a way to obtain all imperfect (P5, diamond)-free graphs by iterated point multiplication or substitution from a /nite collection of small basic graphs. Corollaries of this and other structural properties, among which a result of Bacs1 o and Tuza, are (i) combinat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Graph Theory
دوره 86 شماره
صفحات -
تاریخ انتشار 2017